Geração de algoritmos de escalonamento para simulação de grades computacionais

Pós-graduação em Ciência da Computação - IBILCE

Eficiência de estimadores, geradores e algoritmos na simulação de dados diários de precipitação pluviométrica utilizando a distribuição gama

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Análise de algoritmos computacionais utilizados em sistemas de planejamento de braquiterapia de alta taxa de dose: estudo comparativo com o Código MCNP-5C

In radiotherapy, computational systems are used for radiation dose determination in the treatment’s volume and radiometric parameters quality analysis of equipment and field irradiated. Due to the increasing technological advancement, several research has been performed in brachytherapy for different computational algorithms development which may be incorporated to treatment planning systems, providing greater accuracy and confidence in the dose calculation. Informatics and information technology fields undergo constant updating and refinement, allowing the use Monte Carlo Method to simulate brachytherapy source dose distribution. The methodology formalization employed to dosimetric analysis is based mainly in the American Association of Physicists in Medicine (AAPM) studies, by Task Group nº 43 (TG-43) and protocols aimed at dosimetry of these radiation sources types. This work aims to analyze the feasibility of using the MCNP-5C (Monte Carlo N-Particle) code to obtain radiometric parameters of brachytherapy sources and so to study the radiation dose variation in the treatment planning. Simulations were performed for the radiation dose variation in the source plan and determined the dosimetric parameters required by TG-43 formalism for the characterization of the two high dose rate iridium-192 sources. The calculated values were compared with the presents in the literature, which were obtained with different Monte Carlo simulations codes. The results showed excellent consistency with the compared codes, enhancing MCNP-5C code the capacity and viability in the sources dosimetry employed in HDR brachytherapy. The method employed may suggest a possible incorporation of this code in the treatment planning systems provided by manufactures together with the equipment, since besides reducing acquisition cost, it can also make the used computational routines more comprehensive, facilitating the brachytherapy ...

Programação de horários usando um algoritmo de busca em vizinhança variável

Pós-graduação em Engenharia Elétrica - FEIS

Desenvolvimento de um método numérico para simular escoamentos viscoelásticos axissimétricos com superfícies livres: Modelo PTT

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Ambiente independente de idioma para suporte a identificação de tuplas duplicadas por meio da similaridade fonética e numérica: otimização de algoritmo baseado em multithreading

Pós-graduação em Ciência da Computação - IBILCE

Aplicativo computacional para obtenção de probabilidades a priori de classificação errônea em experimentos agronômicos

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Métodos de solução para um problema de sequenciamento da produção com sincronismo de execução de tarefas

Pós-graduação em Engenharia Mecânica - FEG

Desenvolvimento de algoritmo para modelagem e simulação de sistemas por grafos de ligação

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Algoritmo de escalonamento de instância de máquina virtual na computação em nuvem

Pós-graduação em Ciência da Computação - IBILCE

Métodos de otimização aplicados no ajuste de ESPS e controladores de amortecimento inseridos no FACTS TCSC em sistemas elétricos de potência

Pós-graduação em Engenharia Elétrica - FEIS

Simplificação de malhas visando representações em multirresolução

The representation of real objects in virtual environments has applications in many areas, such as cartography, mixed reality and reverse engineering. The generation of these objects can be performed through two ways: manually, with CAD (Computer Aided Design) tools, or automatically, by means of surface reconstruction techniques. The simpler the 3D model, the easier it is to process and store it. However, this methods can generate very detailed virtual elements, that can result in some problems when processing the resulting mesh, because it has a lot of edges and polygons that have to be checked at visualization. Considering this context, it can be applied simplification algorithms to eliminate polygons from resulting mesh, without change its topology, generating a lighter mesh with less irrelevant details. The project aimed the study, implementation and comparative tests of simplification algorithms applied to meshes generated through a reconstruction pipeline based on point clouds. This work proposes the realization of the simplification step, like a complement to the pipeline developed by (ONO et al., 2012), that developed reconstruction through cloud points obtained by Microsoft Kinect, and then using Poisson algorithm

Algoritmo de resolução de EDO de primeira ordem com implementação em HTML

This work presents a theoretical study of ordinary differential equations of first order directed so as to provide basis for the development of an educational software that helps students and researchers confronted with this issue. The algorithm was developed in HTML language in to that the results provide a website that allows the audience to access the software anywhere which has internet connection

Atribuição de turmas para professores via Beam Search em Java

In the universities, before the start of each school year, is held the distribution of classes among available teachers. Therefore, it is necessary to consider the maximum workweek for each teacher and their preferences for each discipline, to prevent a teacher to give lessons in two separate locations at the same time and to avoid some teachers to become overloaded while others with large clearance. This process, manually performed, is time consuming and does not allow the visualization of other combinations of assignment of teachers to classes, besides being liable to error. This work aims to develop a decision support tool for the problem of assigning teachers to classes in college. The project encompasses the development of a computer program using the concepts of object orientation and a tree search algorithm of a combinatorial nature called Beam Search. The programming language used is Java and the program has a graphical interface for entering and manipulating data of the problem. Once obtained the schedule data of classes and teachers is possible, by means of the tool, perform various simulations and manual adjustments to achieve the final result. It is an efficient method of class scheduling, considering the speed of task execution and the fact that it generates only feasible results

O aprimoramento de um software de estúdio virtual por meio de técnicas de matting digital e registro de objetos virtuais

A virtual studio system can use technologies as augmented reality and digital matting to decrease production costs at the same time it provides the same resources of a conventional studio. With this, it’s possible for the current studios, with low cost and using conventional devices, to create productions with greater image quality and effects. Some difficulties are recurrent in virtual studio applications that use augmented reality and digital matting. The virtual objects registration in augmented reality techniques suffer from problems caused by optical distortions in the camera, errors in the marker tracking system, lack of calibration on the equipments or on the environment (lighting, for example), or even by delays in the virtual objects display. On the other hand, the digital matting’s main problem is the real-time execution to preview the scene, which must have optimized processing speed at the same time while maintain the best image quality possible. Taking the given context into consideration, this work aims to give continuity to a virtual studio system called ARStudio, by enhancing digital matting, virtual objects registration and introducing a segmentation based on depth map, yet adding better control over functionalities previously implemented